Geodesic Computation for Adaptive Remeshing

This video presents an application of geodesic computation on 3D meshes to surface remeshing. The farthest point paradigm [1] is a powerful greedy algorithm that allows fast and accurate sampling of the underlying surface. The use of a varying speed function for front propagation enables an adaptive placement of the seed points. The connectivity of the resulting mesh is computed using a geodesic Delaunay triangulation of the sampling points. The user can provide a speed function to conform the remeshing to various contraints such as curvature variation or texture gradient. This remeshing method is fast thanks to the use of the Fast Marching algorithm. It is simple to implement, robust and can serve as a basis building block for further processing of the surface such as segmentation [3] or flattening [2].